Pitch Spelling Algorithms
نویسنده
چکیده
In this paper I introduce a new algorithm called ps13 that reliably computes the correct pitch names (e.g., C 4, B 5 etc.) of the notes in a passage of tonal music, when given only the onset-time and MIDI note number of each note in the passage. ps13 correctly predicts the pitch names of 99.81% of the notes in a test corpus containing 41544 notes and consisting of all the pieces in the first book of J. S. Bach's Das Wohltemperirte Klavier (BWV 846--869). Three previous algorithms (those of Cambouropoulos (1996, 1998, 2002), Longuet-Higgins (1987) and Temperley (2001)) were run on the same corpus of 41544 notes. On this corpus, Cambouropoulos's algorithm made 2599 mistakes, LonguetHiggins's algorithm made 265 mistakes and Temperley's algorithm made 122 mistakes. As ps13 made only 81 mistakes on the same corpus, this suggests that ps13 may be more robust than previous algorithms that attempt to perform the same task.
منابع مشابه
PST : Pitch Spelling
Pitch spelling is the process of assigning contextually correct letter names to numeric representations for musical pitch such as MIDI numbers. Each pitch is represented by a number in MIDI and other digital formats, and the same number, say, 58 could map to A# or Bb depending on the key context. Accurate pitch spelling is a critical component of systems for automated transcription, computer mu...
متن کاملDetermining context-defining windows: Pitch spelling using the spiral array
This paper presents algorithms for pitch spelling using the Spiral Array model. Accurate pitch spelling, assigning contextually consistent letter names to pitch numbers (for example, MIDI), is a critical component of music transcription and analysis systems. The local context is found to be more important than the global, but a combination of both achieves the best results.
متن کاملPitch spelling: Investigating reductions of the search space
Pitch spelling addresses the question of how to derive traditional score notation from pitch classes or MIDI numbers. In this paper, we motivate that the diatonic notes in a piece of music are easier to spell correctly than the non-diatonic notes. Then we investigate 1) whether the generally used method of calculating the proportion of correctly spelled notes to evaluate pitch spelling models c...
متن کاملAutomatic Pitch Spelling: From Numbers to Sharps and Flats
In this paper a computational model is described that transcribes polyphonic MIDI pitch files into the Western traditional music notation. Input to the proposed algorithm input is merely a sequence of MIDI pitch numbers in the order they appear in a MIDI file. No a priori knowledge is required such as key signature, tonal centers, time signature, voice separation and so on. Output of the algori...
متن کاملComparing Pitch Spelling Algorithms on a Large Corpus of Tonal Music
This paper focuses on the problem of constructing a reliable pitch spelling algorithm—that is, an algorithm that computes the correct pitch names (e.g., C]4, B[5 etc.) of the notes in a passage of tonal music, when given only the onset-time, MIDI note number and possibly the duration of each note. The author’s ps13 algorithm and the pitch spelling algorithms of Cambouropoulos, Temperley and Lon...
متن کاملComparing Pitch Spelling Algorithms
A pitch spelling algorithm predicts the pitch names of the notes in a musical passage when given the onset-time, MIDI note number and possibly the duration and voice of each note. Various versions of the algorithms of LonguetHiggins, Cambouropoulos, Temperley and Sleator, Chew and Chen, and Meredith were run on a corpus containing 195972 notes, equally divided between eight classical and baroqu...
متن کامل